Fair-Zero Knowledge
نویسندگان
چکیده
We introduce Fair Zero-Knowledge, a multi-verifier ZK system where every proof is guaranteed to be “zero-knowledge for all verifiers.” That is, if an honest verifier accepts a fair zero-knowledge proof, then he is assured that all other verifiers also learn nothing more than the verity of the statement in question, even if they maliciously collude with a cheating prover. We construct Fair Zero-Knowledge systems based on standard complexity assumptions (specifically, the quadratic residuosity assumption) and an initial, one-time use of a physically secure communication channel (specifically, each verifier sends the prover a private message in an envelope). All other communication occurs (and must occur) on a broadcast
منابع مشابه
Constructing Optimistic ID-Based Fair Exchange Protocols via Proxy Signature
This paper introduces a natural paradigm for fair exchange protocols, called ID-based partial proxy signature scheme. A security model with precise and formal definitions is presented, and an efficient and provably secure partial proxy signature scheme is proposed. This is a full ID-based optimistic fair exchange protocol. Unlike the vast majority of previously proposed protocols, this approach...
متن کاملFair Exchange of Short Signatures without Trusted Third Party
We propose a protocol to exchange Boneh-Boyen short signatures in a fair way, without relying on a trusted third party. Our protocol is quite practical and is the first of the sort to the best of our knowledge. Our construction uses a new non-interactive zero-knowledge (NIZK) argument to prove that a commitment is the encryption of a bit vector. We also design a NIZK argument to prove that a co...
متن کاملEfficiently Making Secure Two-Party Computation Fair
Secure two-party computation cannot be fair against malicious adversaries, unless a trusted third party (TTP) or a gradual-release type super-constant round protocol is employed. Existing optimistic fair two-party computation protocols with constant rounds are either too costly to arbitrate (e.g., the TTP may need to re-do almost the whole computation), or require the use of electronic payments...
متن کاملÉtudes in non-interactive zero-knowledge
N a ZERO-KNOWLEDGE PROOF [GMR85], Prover interactively convinces Verifier that theorem 7r is true in such a way that (a) a corrupt Prover cannot convince Verifier of a false theorem and (b) a corrupt Verifier cannot "learn" anything other than the fact that r is true. In a NON-INTERACTIVE ZERO-KNOWLEDGE PROOF [BFM88], the Prover must do the above by sending only a single message to Verifier! To...
متن کاملCalibration of Fair Social Discount Rate in Utilizing Iran Oil Resources: An Islamic View Point
There is a long tradition in economics about the question of whether intergenerational discounting is fair or not. Ramsey (1928) was the first economist that criticized the discounting and mentioned that the just rate of discounting is zero. In this paper it was tried to calculate the just rate of discounting for Iran with respect to Islamic thoughts. According to Islam, intergenerational just...
متن کامل